Tracking of Points in a Calibrated and Noisy Image Sequence
نویسندگان
چکیده
In this paper an algorithm that performs the tracking of points in a calibrated and noisy image sequence is presented. The candidate points to be tracked must satisfy certain constraints that can be deduced from the multiple view geometry. The idea is to consider as noisy points those candidates which cannot be tracked in the sequence. The robustness of the algorithm has been verified on simulated data using different constraints. The methods are assessed in several cases where the number of noisy points and the noise in the measurement of the points to be tracked are varied. Using this study, it is possible to know the performance of the tracking method. An example that shows a perfect tracking of 8 points in a sequence of 10 images with 500 noisy points per image is shown.
منابع مشابه
DPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملAnalysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model
Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...
متن کاملارائهی روشی مقاوم نسبت به تغییرات روشنایی در آشکارسازی و ردیابی خودروها درصحنههای ترافیکی
In this paper, according to the detection and tracking of the moving vehicles at junctions, a rapid method is proposed which is based on intelligent image processing. In the detection part, the Gaussian mixture model has been used to obtain the moving parts. Then, the targets have been detected using HOG features extracted from training images, Ada-boost Cascade Classifier and the trained SVM. ...
متن کاملNoisy images edge detection: Ant colony optimization algorithm
The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...
متن کاملStrong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کامل